#include <iostream>
#include <vector>
using namespace std;

int main()
{
	int n;
	cin>>n;

	int largest = -1;
	int box[110][110] = {0};
	for (int i = 0; i < n; ++i)
	{
		int tmp;
		cin>>tmp;
		
		largest = max(largest, tmp);
		for (int j = 0; j < tmp; ++j)
			box[j][i] = 1;
	}

	// shift
	for (int i = largest; i >= 0; --i)
	{
		int cnt = 0;
		for (int j = 0; j < n; ++j)
			cnt += box[i][j];

		memset (&box[i][0], 0, sizeof(int)*110);
		for (int j = 0; j < cnt; ++j)
			box[i][n-1-j] = 1;
	}

	// count
	for (int i = 0; i < n; ++i)
	{
		int cnt = 0;
		for (int j = 0; j < 110; ++j)
			cnt += box[j][i];
		cout<<cnt<<" ";
	}
	cout<<endl;
}